A New Tight Upper Bound on the Entropy of Sums
نویسندگان
چکیده
We consider the independent sum of a given random variable with a Gaussian variable and an infinitely divisible one. We find a novel tight upper bound on the entropy of the sum which still holds when the variable possibly has an infinite second moment. The proven bound has several implications on both information theoretic problems and infinitely divisible noise channels’ transmission rates.
منابع مشابه
Sharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
متن کاملAn entropy inequality for symmetric random variables
We establish a lower bound on the entropy of weighted sums of (possibly dependent) random variables (X1, X2, . . . , Xn) possessing a symmetric joint distribution. Our lower bound is in terms of the joint entropy of (X1, X2, . . . , Xn). We show that for n ≥ 3, the lower bound is tight if and only if Xi’s are i.i.d. Gaussian random variables. For n = 2 there are numerous other cases of equality...
متن کاملمحاسبه فاصله عدم قطعیت بر پایه آنتروپی شانون و تئوری دمپستر-شافر از شواهد
Abstract Dempster Shafer theory is the most important method of reviewing uncertainty for information system. This theory as introduced by Dempster using the concept of upper and lower probabilities extended later by Shafer. Another important application of entropy as a basic concept in the information theory can be used as a uncertainty measurement of the system in specific situation In th...
متن کاملA New Acceptance Sampling Plan Based on Cumulative Sums of Conforming Run-Lengths
In this article, a novel acceptance-sampling plan is proposed to decide whether to accept or reject a receiving batch of items. In this plan, the items in the receiving batch are inspected until a nonconforming item is found. When the sum of two consecutive values of the number of conforming items between two successive nonconforming items falls underneath of a lower control threshold, the batc...
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Entropy
دوره 17 شماره
صفحات -
تاریخ انتشار 2015